S-PowerGraph: Streaming Graph Partitioning for Natural Graphs by Vertex-Cut
نویسندگان
چکیده
Cong Xie Department of Computer Science and Engineering Shanghai Jiao Tong University 800 Dong Chuan Road Shanghai, China 200240 [email protected] Wu-Jun Li National Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University [email protected] Zhihua Zhang Department of Computer Science and Engineering Shanghai Jiao Tong University 800 Dong Chuan Road Shanghai, China 200240 [email protected]
منابع مشابه
ADWISE: Adaptive Window-based Streaming Edge Partitioning for High-Speed Graph Processing
In recent years, the graph partitioning problem gained importance as a mandatory preprocessing step for distributed graph processing on very large graphs. Existing graph partitioning algorithms minimize partitioning latency by assigning individual graph edges to partitions in a streaming manner — at the cost of reduced partitioning quality. However, we argue that the mere minimization of partit...
متن کاملGRE: A Graph Runtime Engine for Large-Scale Distributed Graph-Parallel Applications
Large-scale distributed graph-parallel computing is challenging. On one hand, due to the irregular computation pattern and lack of locality, it is hard to express parallelism efficiently. On the other hand, due to the scale-free nature, realworld graphs are hard to partition in balance with low cut. To address these challenges, several graph-parallel frameworks including Pregel and GraphLab (Po...
متن کاملJust chromatic exellence in fuzzy graphs
A fuzzy graph is a symmetric binary fuzzy relation on a fuzzy subset. The concept of fuzzy sets and fuzzy relations was introduced by L.A.Zadeh in 1965cite{zl} and further studiedcite{ka}. It was Rosenfeldcite{ra} who considered fuzzy relations on fuzzy sets and developed the theory of fuzzy graphs in 1975. The concepts of fuzzy trees, blocks, bridges and cut nodes in fuzzy graph has been studi...
متن کاملStreaming Balanced Graph Partitioning Algorithms for Random Graphs
With recent advances in storage technology, it is now possible to store the vast amounts of data generated by cloud computing applications. The sheer size of ‘big data’ motivates the need for streaming algorithms that can compute approximate solutions without full random access to all of the data. In this paper, we consider the problem of loading a graph onto a distributed cluster with the goal...
متن کاملPowerGraph: Distributed Graph-Parallel Computation on Natural Graphs
Large-scale graph-structured computation is central to tasks ranging from targeted advertising to natural language processing and has led to the development of several graph-parallel abstractions including Pregel and GraphLab. However, the natural graphs commonly found in the real-world have highly skewed power-law degree distributions, which challenge the assumptions made by these abstractions...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1511.02586 شماره
صفحات -
تاریخ انتشار 2015